Objective function-based rough membership C-means clustering
نویسندگان
چکیده
منابع مشابه
Bilateral Weighted Fuzzy C-Means Clustering
Nowadays, the Fuzzy C-Means method has become one of the most popular clustering methods based on minimization of a criterion function. However, the performance of this clustering algorithm may be significantly degraded in the presence of noise. This paper presents a robust clustering algorithm called Bilateral Weighted Fuzzy CMeans (BWFCM). We used a new objective function that uses some k...
متن کاملA Hybrid Time Series Clustering Method Based on Fuzzy C-Means Algorithm: An Agreement Based Clustering Approach
In recent years, the advancement of information gathering technologies such as GPS and GSM networks have led to huge complex datasets such as time series and trajectories. As a result it is essential to use appropriate methods to analyze the produced large raw datasets. Extracting useful information from large data sets has always been one of the most important challenges in different sciences,...
متن کاملBasic Properties of Rough Sets and Rough Membership Function
Let A be a set. One can verify that 〈A, idA〉 is discrete. The following proposition is true (1) For every set X such that ∇X ⊆ idX holds X is trivial. Let A be a relational structure. We say that A is diagonal if and only if: (Def. 1) The internal relation of A ⊆ idthe carrier of A. Let A be a non trivial set. Observe that 〈A,∇A〉 is non diagonal. We now state the proposition (2) For every refle...
متن کاملAn Innovative Algorithm for Feature Selecton Based on Rough Set with Fuzzy C-means Clustering
Feature selection is a fundamental problem in data mining, especially for high level dimensional datasets. Feature selection is a process commonly used in machine learning, wherein subsets of the features from the original set of features are selected for application of a learning algorithm. The best subset contains the minimum number of dimensions retaining a suitably high accuracy on classifi...
متن کاملFuzzy C-Means Clustering-Based Speaker Verification
In speaker verification, a claimed speaker’s score is computed to accept or reject the speaker claim. Most of the current normalisation methods compute the score as the ratio of the claimed speaker’s and the impostors’ likelihood functions. Based on analysing false acceptance error occured by the current methods, we propose a fuzzy c-means clusteringbased normalisation method to find a better s...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information Sciences
سال: 2021
ISSN: 0020-0255
DOI: 10.1016/j.ins.2020.10.037